#include <bits/stdc++.h>
using namespace std;

const int N = 100005;
int n, a[N];
vector<int> v;

int main() {
    freopen("duel.in", "r", stdin);
    freopen("duel.out", "w", stdout);
    cin >> n;
    for (int i = 1; i <= n; i++)
        cin >> a[i];
    sort(a + 1, a + n + 1, greater<>());
    for (int i = 1; i <= n; i++) {
        if (a[i] != a[i - 1]) v.push_back(1);
        else v.back()++;
    }
    // for (int i = 1; i < v.size(); i++) {
    //     int mn = min(v[i - 1], v[i]);
    //     v[i - 1] -= mn;
    //     v[i] -= mn;
    // }
    // cout << accumulate(v.begin(), v.end(), 0) << endl;
    cout << *max_element(v.begin(), v.end()) << endl;
    return 0;
}